A sparse H-matrix arithmetic: general complexity estimates
نویسندگان
چکیده
منابع مشابه
A sparse H-matrix arithmetic: general complexity estimates
In a preceding paper (Hackbusch, Computing 62 (1999) 89–108), a class of matrices (H-matrices) has been introduced which are data-sparse and allow an approximate matrix arithmetic of almost linear complexity. Several types ofH-matrices have been analysed in Hackbusch (Computing 62 (1999) 89–108) and Hackbusch and Khoromskij (Preprint MPI, No. 22, Leipzig, 1999; Computing 64 (2000) 21–47) which ...
متن کاملA Sparse Matrix Arithmetic based on H-Matrices. Part I: Introduction to H-Matrices
A class of matrices (H-matrices) is introduced which have the following properties. (i) They are sparse in the sense that only few data are needed for their representation. (ii) The matrix-vector multiplication is of almost linear complexity. (iii) In general, sums and products of these matrices are no longer in the same set, but their truncations to the H-matrix format are again of almost line...
متن کاملImplementation of Sparse Matrix Arithmetic on a DSP Processor
The paper presents a method for sparse matrix multiplication on a DSP processor. Its high efficiency is a consequence of the proposed pseudo-random data memory access and parallelism of the multifunctional instructions of a DSP. Sparse matrix multiplication is implemented as linear expanded DSP code automatically generated by specially designed program. The method is applied to predictive vecto...
متن کاملThe I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N ×N matrix A with a dense N ×N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a constant factor for all meaningful choices of the parameters N (dimension of the matrices), k (average number of non-zero entries per column or row in A, i.e., there are in total kN non-zero entries), M (main memory size), ...
متن کاملA general purpose sparse matrix parallel solvers package
A parallel solvers package of three solvers with a unified user interface is developed for solving a range of sparse symmetric complex linear systems arising from disc~tization of partial differential equations based on unstructu~d meshs using finite element, finite difference and finite volume analysis. Once the data interface is set up, the package constructs the sparse symmetric complex matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00486-6